Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design

Emulations Between QSM , BSP and LogP : A Framework for General - Purpose Parallel Algorithm

QSM: A General Purpose Shared-Memory Model for Parallel Computation

We describe a general-purpose shared-memory model for parallel computation, called the qsm [22], which provides a high-level shared-memory abstraction for parallel algorithm design, as well as the ability to be emulated in an e ective manner on the bsp, a lower-level, distributedmemory model. We present new emulation results that show that very little generality is lost by not having a `gap par...

Bsp Vs Logp 1

A quantitative comparison of the BSP and LogP models of parallel computation is developed. We concentrate on a variant of LogP that disallows the so-called stalling behavior, although issues surrounding the stalling phenomenon are also explored. Very eecient cross simulations between the two models are derived, showing their substantial equivalence for algorithmic design guided by asymptotic an...

A General-Purpose Parallel Sorting Algorithm

A parallel sorting algorithm is presented for general purpose internal sorting on MIMD machines. The algorithm initially sorts the elements within each node using a serial sorting algorithm, then proceeds with a two-phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm...

Design and Implementation of a General Purpose Parallel Programming System

In scientific computing, the use of parallelism has led to widespread improvements in the performance of complex computations. However, there are many non-scientific general purpose applications that could also benefit from the modest use of parallelism. The users of these applications generally work in offices possessing large networks of PCs. If programmers could only write programs that coul...